Kripke Logical Relations and PCF
نویسندگان
چکیده
منابع مشابه
Kripke Logical Relations and PCF
Sieber has described a model of PCF consisting of continuous functions that are invariant under certain ((nitary) logical relations, and shown that it is fully abstract for closed terms of up to third-order types. We show that one may achieve full abstraction at all types using a form of \Kripke logical relations" introduced by Jung and Tiuryn to characterize-deenability.
متن کاملPcf Deenability via Kripke Logical Relations (after O'hearn and Riecke)
The material presented here is an exposition of an application of logical relations to the problem of full abstraction for PCF. The point is to see Kripke logical relations as introduced by Jung and Tiuryn in [5] and used by O'Hearn and Riecke in [6] to give a logical characterization of sequentiality, within the mainstream of the classical notion of logical relations. The main di erence with r...
متن کاملLogical Relations for PCF
We apply Andy Pitts’s methods of defining relations over domains to several classical results in the literature. We show that the Y combinator coincides with the domaintheoretic fixpoint operator, that parallel-or and the Plotkin existential are not definable in PCF, that the continuation semantics for PCF coincides with the direct semantics, and that our domain-theoretic semantics for PCF is a...
متن کاملMechanizing Proofs with Logical Relations – Kripke-style
Proofs with logical relations play a key role to establish rich properties such as normalization or contextual equivalence. They are also challenging to mechanize. In this paper, we describe two case studies using the proof environment Beluga: first, we explain the mechanization of the weak normalization proof for the simply-typed lambda-calculus; second, we outline how to mechanize the complet...
متن کاملThe Marriage of Bisimulations and Kripke Logical Relations Technical Appendix
1 Language 3 1.1 Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Dynamic Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 Static Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.4 Contextual Equivalence . . . . . . . . . . . . . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1995
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1103